منابع مشابه
Matrix techniques for strongly regular graphs and related geometries
(otherwise we divide the vector by an appropriate scalar), so w.l.o.g. we have uj = 1 for a certain j ∈ {1, . . . , v}. The absolute value |(A~u)j| of the j-th component of A~u is at most ∑ i∼j |ui|; since the absolute values of all components of ~u are less than or equal to 1, we have ∑ i∼j |ui| ≤ k. On the other hand |(A~u)j| must be equal to |ρuj| = |ρ|, from which we obtain |ρ| ≤ k. If ρ = ...
متن کاملRing geometries, two-weight codes, and strongly regular graphs
It is known that a linear two-weight code C over a finite field Fq corresponds both to a multiset in a projective space over Fq that meets every hyperplane in either a or b points for some integers a < b , and to a strongly regular graph whose vertices may be identified with the codewords of C . Here we extend this classical result to the case of a ring-linear code with exactly two nonzero homo...
متن کاملFuzzy $e$-regular spaces and strongly $e$-irresolute mappings
The aim of this paper is to introduce fuzzy ($e$, almost) $e^{*}$-regular spaces in $check{S}$ostak's fuzzy topological spaces. Using the $r$-fuzzy $e$-closed sets, we define $r$-($r$-$theta$-, $r$-$etheta$-) $e$-cluster points and their properties. Moreover, we investigate the relations among $r$-($r$-$theta$-, $r$-$etheta$-) $e$-cluster points, $r$-fuzzy ($e$, almost) $e^{*}$-regular spaces a...
متن کاملStrongly regular graphs
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.
متن کاملDistance-Regular Graphs with Strongly Regular Subconstituents
In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0, 1} for i = 2, . . . , d .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2001
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3164